The (S−1,S) inventory model and its counterparts in queueing theory

We explore the relationship between the ($S?1,S$) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the ($S?1,S$) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.     

Infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm system

We consider the infinite propagation speed of a weakly dissipative modified two-component Dullin–Gottwald–Holm (mDGH2) system. The infinite propagation speed is derived for the corresponding solution with compactly supported initial data that does not have compact support any longer in its lifespan.     

G2-manifolds and the ADM formalism

In this paper we study a Hamiltonian function on the cotangent bundle of the space of Riemannian metrics on a 3-manifold M and prove the orbits of the constrained Hamiltonian dynamical system correspond to $G_2$-manifolds foliated by hypersurfaces diffeomorphic to $M\times \mathrm{SO}(3)$.     

Using block designs in crossing number bounds

The crossing number $\mathrm{\text{CR}}\left(G\right)$ of a graph $G=\left(V,E\right)$ is the smallest number of edge crossings over all drawings of $G$ in the plane. For any $k\ge 1$, the $k$‐planar crossing number of $G,{\mathrm{\text{CR}}}_k\left(G\right)$, is defined as the minimum of $\text{CR}\left(G_1\right)+\text{CR}\left(G_2\right)+?+\text{CR}\left(G_k\right)$ over all graphs $G_1,G_2,\dots ,G_k$ with ${\cup }_{i=1}^k{G}_i=G$. Pach et al [Comput. Geom.: Theory Appl. 68 (2018), pp. 2–6] showed that for every $k\ge 1$, we have ${\text{CR}}_k\left(G\right)\le (2/k^2?1/k^3)\text{CR}\left(G\right)$ and that this bound does not remain true if we replace the constant $2/k^2?1/k^3$ by any number smaller than $1/k^2$. We improve the upper bound to $(1/k^2)\left(1+o\left(1\right)\right)$ as $k\to \infty$. For the class of bipartite graphs, we show that the best constant is exactly $1/k^2$ for every $k$. The results extend to the rectilinear variant of the $k$‐planar crossing number.     

Simultaneous separation and determination of seven isoflavones in Radix Puerariae by capillary electrophoresis with a dual cyclodextrin system

A simple, comprehensive and efficient capillary electrophoresis method using a dual cyclodextrin system was developed for the simultaneous determination of seven isoflavones (3′‐methoxypuerarin, puerarin, 3′‐hydroxypuerarin, ononin, daidzin, daidzein and genistin). Baseline separations of the seven isoflavones were achieved within 11 min with the running buffer consisting of 35 mm sodium tetraborate, 9.0 mm sulfobutylether‐β‐cyclodextrin and 30 mm α‐cyclodextrin at pH 9.34, and peaks were detected at 254 nm. Other separation parameters included the separation voltage for 15 kV and the working temperature for 25°C. Under the optimum conditions, good linearities were obtained with linear correlation coefficients of seven isoflavones of 0.9978–0.9992. The limits of detection and the limits of quantification were 0.7–2.9 and 2.5–9.5 μg/mL, respectively. Excellent precision and accuracy were obtained. The intraday and interday precision ranged from 0.7 to 2.0% and from 0.8 to 1.9%, respectively. The recoveries of seven analytes were from 97.7 to 103.1%. This method was successfully applied to determine the seven analytes in Radix Puerariae and its preparations.     

Perfect matchings extend to two or more hamiltonian cycles in hypercubes

Kreweras conjectured that every perfect matching of a hypercube $Q_n$ for $n\ge 2$ can be extended to a hamiltonian cycle of $Q_n$. Fink confirmed the conjecture to be true. It is more general to ask whether every perfect matching of $Q_n$ for $n\ge 2$ can be extended to two or more hamiltonian cycles of $Q_n$. In this paper, we prove that every perfect matching of $Q_n$ for $n\ge 4$ can be extended to at least $2^{2^{n?4}}$ different hamiltonian cycles of $Q_n$.     

Singular Hamiltonian elliptic systems with critical exponential growth in dimension two

We will focus on the existence of nontrivial solutions to the following Hamiltonian elliptic system where are numbers belonging to the interval [0, 2), V is a continuous potential bounded below on by a positive constant and the functions f and g possess exponential growth range established by Trudinger–Moser inequalities in Lorentz–Sobolev spaces. The proof involves linking theorem and a finite‐dimensional approximation.     

Optimal strategy of vaccination and treatment in an SIRS model with Markovian switching

Medical treatment and vaccination decisions are often sequential and uncertain. Markov decision process is an appropriate means to model and handle such stochastic dynamic decisions. This paper studies the near‐optimality of a stochastic SIRS epidemic model that incorporates vaccination and saturated treatment with regime switching. The stochastic model takes white noises and color noise into account. We first prove some priori estimates of the susceptible, infected, and recovered populations. Moreover, we establish some sufficient and necessary conditions of the near‐optimality by Pontryagin stochastic maximum principle. Our results show that the two kinds of environmental noises have great impacts on the infectious diseases. Finally, we illustrate our conclusions through numerical simulations.